Main-memory triangle computations for very large (sparse (power-law)) graphs
نویسندگان
چکیده
منابع مشابه
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a detailed survey of proposed main-memory solutions to these problems, in an unified way. We note that previous authors paid surprisingly little attention t...
متن کاملPractical algorithms for triangle computations in very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles in large graphs are natural problems, which received recently much attention because of their importance in complex network analysis. However, the time and/or space requirements of known algorithms limit our ability to solve these problems in practice. We give here a quick overview of previous results, with a special emphasis on space requirements, whi...
متن کاملTheory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a detailed state of the art on these problems, in a unified way. We note that, until now, authors paid surprisingly little attention to space complexity, desp...
متن کاملMemory Hardware Support for Sparse Computations
Address computations and indirect, hence double, memory accesses in sparse matrix application software render sparse computations to be ine cient in general. In this paper we propose memory architectures that support the storage of sparse vectors and matrices. In a rst design, called vector storage, a matrix is handled as an array of sparse vectors, stored as singly-linked lists. Deletion and i...
متن کاملTriangle Factors In Sparse Pseudo-Random Graphs
The goal of the paper is to initiate research towards a general, Blow-up Lemma type embedding statement for pseudo-random graphs with sublinear degrees. In particular, we show that if the second eigenvalue λ of a d-regular graph G on 3n vertices is at most cd/n logn, for some sufficiently small constant c> 0, then G contains a triangle factor. We also show that a fractional triangle factor alre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.07.017